2 Randomized rounding approach for UFL
نویسنده
چکیده
منابع مشابه
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1+2=e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)approximation algorithm for the UFL problem. Our linear programing rounding algorithm is the rst one that touches the approximability limit curve ( f ; 1 + 2e f ) established by Jain et al. As a consequence, we obtai...
متن کاملA Dependent LP-Rounding Approach for the k-Median Problem
In this paper, we revisit the classical k-median problem: Given n points in a metric space, select k centers so as to minimize the sum of distances of points to their closest center. Using the standard LP relaxation for k-median, we give an efficient algorithm to construct a probability distribution on sets of k centers that matches the marginals specified by the optimal LP solution. Our algori...
متن کاملLP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
The Fault-Tolerant Facility Placement problem (FTFP) is a generalization of the classic Uncapacitated Facility Location Problem (UFL). In FTFP we are given a set of facility sites and a set of clients. Opening a facility at site i costs fi and connecting client j to a facility at site i costs dij. We assume that the connection costs (distances) dij satisfy the triangle inequality. Multiple faci...
متن کاملNew Results on the Fault-Tolerant Facility Placement Problem
In the Fault-Tolerant Facility Placement problem (FTFP), we are given a set F of sites at which facilities can be built, and a set C of clients with some demands that need to be satisfied by different facilities. A client j has demand rj . Building one facility at a site i incurs a cost fi, and connecting one unit of demand from client j to a facility at site i ∈ F costs dij . The distances dij...
متن کاملAn Approximation Algorithm for MAX-2-SAT with Cardinality Constraint
We present a randomized polynomial-time approximation algorithm for the MAX-2-SAT problem in the presence of an extra cardinality constraint which has an asymptotic worst-case ratio of 0.75. This improves upon the previously best approximation ratio 0.6603 which was achieved by Bläser and Manthey [BM]. Our approach is to use a solution obtained from a linear program which we first modify greedi...
متن کامل